DMVP: Foremost Waypoint Coverage of Time-Varying Graphs

We consider the Dynamic Map Visitation Problem (DMVP), in which a team of agents must visit a collection of critical locations as quickly as possible, in an environment that may change rapidly and unpredictably during the agents' navigation. We apply recent formulations of time-varying graphs (TVGs) to DMVP, shedding new light on the computational hierarchy $\mathcal{R} \supset \mathcal{B} \supset \mathcal{P}$ of TVG classes by analyzing them in the context of graph navigation. We provide hardness results for all three classes, and for several restricted topologies, we show a separation between the classes by showing severe inapproximability in $\mathcal{R}$, limited approximability in $\mathcal{B}$, and tractability in $\mathcal{P}$. We also give topologies in which DMVP in $\mathcal{R}$ is fixed parameter tractable, which may serve as a first step toward fully characterizing the features that make DMVP difficult.Comment: 24 pages. Full version of paper from Proceedings of WG 2014, LNCS, Springer-Verla

Light Neutralinos with Large Scattering Cross Sections in the Minimal Supersymmetric Standard Model

Motivated by recent data from CoGeNT and the DAMA annual modulation signal, we discuss collider constraints on MSSM neutralino dark matter with mass in the 5-15 GeV range. Such an LSP would be a Bino with a small Higgsino admixture. Maximization of the DM-nucleon scattering cross section for such a WIMP requires a light Higgs boson with tan beta enhanced couplings. Limits on the invisible width of the Z boson, when combined with Tevatron constraints on Higgs bosons at large tan beta, and the rare decay $B^{\pm} \to \tau \nu$ constrain cross sections to be below $\sigma_n \lesssim 2 \times 10^{-41} {cm}^2$. This indicates a slight local Dark Matter over-density would be necessary to explain the CoGeNT excess. This scenario also requires a light charged Higgs boson, which can give substantial contributions to rare decays such as $b \to s \gamma$ and $t \to b H^+$.Comment: 5 pages, 3 figures. v2: refs updated, minor typos corrected, new discussion on B->D\tau\nu, journal versio

A User-Level Introduction to the Nuprl Proof Development System

This document is intended to introduce the key elements of the Nuprl Proof Development System (Nuprl, for short) from the perspective of a Nuprl user, as opposed to the perspective of someone intimately involved in developing or extending Nuprl. As such, it may be more appropriate than other Kuprl-related documents for readers who are primarily concerned with uses of Nuprl and not fine details of Nuprl\u27s mathematical foundation. It introduces and illustrates key Kuprl concepts -such as types, terms, displayforms, and tactics - in the framework of a model of calculational predicate logic inference